A Non-commutative Extension of Classical Linear Logic
نویسندگان
چکیده
We extend the multiplicative fragment of linear logic with a non-commutative connective (called before), which, roughly speaking, corresponds to sequential composition. This lead us to a calculus where the conclusion of a proof is a Partially Ordered MultiSET of formulae. We rstly examine coherence semantics, where we introduce the before connective, and ordered products of formulae. Secondly we extend the syntax of multiplicative proof nets to these new operations. We then prove strong normalisation, and connuence. Coming back to the denotational semantics that we started with, we establish in an unusual way the soundness of this calculus with respect to the semantics. The converse, i.e. a kind of completeness result, is simply stated: we refer to a report for its lengthy proof. We conclude by mentioning more results, including a sequent calculus which is interpreted by both the semantics and the proof net syntax, although we are not sure that it takes all proof nets into account. The relevance of this calculus to computational linguistics, process cal-culi, and semantics of imperative programming is brieey explained in the introduction.
منابع مشابه
Simulating Computations in Second Order Non-Commutative Linear Logic
Lincoln, Scedrov and Shankar proved undecidability of intuitionistic second order multiplicative commutative linear logic by embedding LJ2 into this logic. Emms did the same for intuitionistic second order non-commutative linear logic. Recently, Lafont and Scedrov demonstrated undecidability of classical second order multiplicative commutative linear logic. As for classical second order non-com...
متن کاملLogic of predicates versus linear logic
The purpose of this note is to suggest an alternative explanation of the relationship between predicate logics with equality and linear logic. The explanation given by Girard resorts to so called exponentials, which are believed to extract from a linear formula A its classical content !A and ?A. Thus, Girard gives a top-down explanation of the relationship between linear and classical logics: t...
متن کاملNon-Commutative Logic I: The Multiplicative Fragment
We introduce proof nets and sequent calculus for the multiplicative fragment of non-commutative logic, which is an extension of both linear logic and cyclic linear logic. The two main technical novelties are a third switching position for the non-commutative disjunction, and the structure of order variety.
متن کاملLogic of Predicates with Explicit Substitutions
We present a non-commutative linear logic | the logic of predicates with equality and explicit substitutions. Thus, the position of linear logic with respect to the usual logic is given a new explanation. 1 The world according to Girard A recent introduction to linear logic, cf. 13], starts with the following explanation of the position of usual logic with respect to the linear. Linear logic is...
متن کاملNatural Deduction for Intuitionistic Non-Commutative Linear Logic
We present a system of natural deduction and associated term calculus for intuitionistic non-commutative linear logic (INCLL) as a conservative extension of intuitionistic linear logic. We prove subject reduction and the existence of canonical forms in the implicational fragment. We also illustrate by means of an example how the proof term calculus can be employed in the setting of logical fram...
متن کامل